Semisupervised Community Preserving Network Embedding with Pairwise Constraints
نویسندگان
چکیده
منابع مشابه
Community Preserving Network Embedding
Network embedding, aiming to learn the low-dimensional representations of nodes in networks, is of paramount importance in many real applications. One basic requirement of network embedding is to preserve the structure and inherent properties of the networks. While previous network embedding methods primarily preserve the microscopic structure, such as the firstand second-order proximities of n...
متن کاملClustering-driven Deep Embedding with Pairwise Constraints
Recently, there has been increasing interest to leverage the competence of neural networks to analyze data. In particular, new clustering methods that employ deep embeddings have been presented. In this paper, we depart from centroid-based models and suggest a new framework, called Clustering-driven deep embedding with PAirwise Constraints (CPAC), for non-parametric clustering using a neural ne...
متن کاملRobust Locality Preserving Projections with Pairwise Constraints
Dimensionality reduction is one of the key processes of high dimensional data analysis, including machine learning and pattern recognition. Constrained Locality Preserving Projections (CLPP) is a variant of Locality Preserving Projections (LPP) plus with pairwise constraints and constraints propagation. Like LPP, however, CLPP is still sensitive to noise and parameters. To overcome these proble...
متن کاملUser Profile Preserving Social Network Embedding
This paper addresses social network embedding, which aims to embed social network nodes, including user profile information, into a latent lowdimensional space. Most of the existing works on network embedding only consider network structure, but ignore user-generated content that could be potentially helpful in learning a better joint network representation. Different from rich node content in ...
متن کاملNeural network-based clustering using pairwise constraints
In this work, we address the problem of finding a clustering of high-dimensional data using only pairwise constraints provided as input. Our strategy utilizes the back-propagation algorithm for optimizing neural networks to discover the clusters, while at the same time the features are also learned during the same training process. In order to do this, we design a novel architecture that can in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complexity
سال: 2020
ISSN: 1099-0526,1076-2787
DOI: 10.1155/2020/7953758